Buscar
Mostrando ítems 1-10 de 300
Uma nova abordagem branch and cut aplicada ao problema de planejamento da expansão de redes de transmissão de grande porteA new branch and cut approach applied to the long-term transmission expansion planning problem
(Sociedade Brasileira de Automática, 2012)
Neste artigo propomos um algoritmo branch and cut com novas inequações específicas ao problema de planejamento da expansão de redes de transmissão de energia elétrica. Todas as inequações propostas neste trabalho são válidas ...
A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes
(European Journal of Operational Research, 2018)
O problema de roteamento e programação de navios com coleta e entrega na indústria de petróleo : modelagem e métodos de solução exatos
(Universidade Federal de São CarlosUFSCarPrograma de Pós-Graduação em Engenharia de Produção - PPGEPCâmpus São Carlos, 2016-04-01)
The object of this study is the routing and scheduling problem of vessels with pickup
and delivery and time windows in the oil industry. A case study was performed in a Brazilian oil industry that produces crude oil in o ...
Algoritmos branch-and-cut-and-price para o problema da árvore geradora de custo mínimo com restrição de grau
(Universidade Federal de Minas GeraisUFMG, 2014-04-10)
Given an undirected graph G = (V, E) with weighted edges and positive integers dv associated with each vertex v ∈ V , the Degree-Constrained Minimum Spanning Tree Problem (DCMST) consists in nding a minimum cost ...
Mathematical model and solution approaches for integrated lot-sizing, scheduling and cutting stock problems
(Springer, 2020-09-04)
In this paper, we address a two-stage integrated lot-sizing, scheduling and cutting stock problem with sequence-dependent setup times and setup costs. In production stage one, a cutting machine is used to cut large objects ...
Lower Bounds For Large Traveling Umpire Instances: New Valid Inequalities And A Branch-and-cut Algorithm
(PERGAMON-ELSEVIER SCIENCE LTDOXFORD, 2016)
Lower Bounds For Large Traveling Umpire Instances: New Valid Inequalities And A Branch-and-cut Algorithm
(Pergamon-Elsevier Science LTDOxford, 2016)